A ug 2 00 4 The Simplex Algorithm in Dimension Three 1
نویسندگان
چکیده
We investigate the worst-case behavior of the simplex algorithm on linear programs with three variables, that is, on 3-dimensional simple polytopes. Among the pivot rules that we consider, the “random edge” rule yields the best asymptotic behavior as well as the most complicated analysis. All other rules turn out to be much easier to study, but also produce worse results: Most of them show essentially worst-possible behavior; this includes both Kalai’s “random-facet” rule, which without dimension restriction is known to be subexponential, as well as Zadeh’s deterministic history-dependent rule, for which no non-polynomial instances in general dimensions have been found so far.
منابع مشابه
Optimizing the Static and Dynamic Scheduling problem of Automated Guided Vehicles in Container Terminals
The Minimum Cost Flow (MCF) problem is a well-known problem in the area of network optimisation. To tackle this problem, Network Simplex Algorithm (NSA) is the fastest solution method. NSA has three extensions, namely Network Simplex plus Algorithm (NSA+), Dynamic Network Simplex Algorithm (DNSA) and Dynamic Network Simplex plus Algorithm (DNSA+). The objectives of the research reported in this...
متن کاملar X iv : h ep - t h / 04 08 08 8 v 1 1 1 A ug 2 00 4 Milne and Torus Universes Meet
Three dimensional quantum gravity with torus universe, T 2 ×R, topol-ogy is reformulated as the motion of a relativistic point particle moving in an Sl(2, Z) orbifold of flat Minkowski spacetime. The latter is precisely the three dimensional Milne Universe studied recently by Russo as a background for Strings. We comment briefly on the dynamics and quantization of the model. Stanley has made ma...
متن کاملar X iv : h ep - t h / 01 08 06 7 v 1 1 0 A ug 2 00 1 Why 3 + 1 metric rather than 4 + 0 or 2 + 2 ?
Why does the physical 4-dimensional space have a 3 + 1 signature rather than a 4 + 0 or a 2 + 2 for its metric? We give a simple explanation based largely on a group-theoretic argument a la Wigner. Applied to flat spaces of higher dimensions the same approach indicates that metrics with more than one time dimension are physically unacceptable because the corresponding irreducible unitary repres...
متن کاملImprovement of Support Vector Machine and Random Forest Algorithm in Predicting Khorramabad River Flow Uusing Non-uniform De-Noising of data and Simplex Algorithm
In this study, in order to simulate the monthly flow of the Khorramabad River, the time series of this river was decomposed into three levels using the wavelet of Daubechies-3, during the period of 1955-2014. Based on this, it was found that there is a Non-uniform noise that includes two periods of time in this signal, with the October 2008 border which required that the signal be become non-un...
متن کاملar X iv : m at h - ph / 0 40 80 15 v 1 9 A ug 2 00 4 A HYPER - GEOMETRIC APPROACH TO THE BMV - CONJECTURE
We provide a representation of the (signed) BMV-measure by stochastic means and prove positivity of the respective measures in dimension d = 3 in several non-trivial cases by combinatorial methods.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004